explosion n. 1.爆炸,炸裂;爆炸聲。 2.擴(kuò)張,激增;(感情等的)爆發(fā)。 3.【語言學(xué)】爆破。 air [subsurface] explosion 空中[地下]爆炸。 nuclear explosion 核爆炸。 a population explosion 人口爆炸。
combination n. 1.結(jié)合,合并,混合,聯(lián)合,配合,組合。 2.合作;共謀,同謀;同黨。 3.〔pl.〕〔英國〕連褲襯衣。 4.【化學(xué)】化合(物);【礦物】聚形;〔pl.〕【數(shù)學(xué)】組合;【語法】組合詞。 5.附有旁座的摩托車。 6.暗碼鎖(的暗碼)。 a crystal combination合晶。 a missile-cruiser combination配備有導(dǎo)彈的巡洋艦。 in combination with 和…共同[結(jié)合、協(xié)同、協(xié)力、共謀]。
Such a model tries to solve the problem lacking of information in concept design , increase the speed of searching optimization and avoid the combination explosion 該模型力圖解決概念設(shè)計(jì)中信息匱乏問題、提高尋優(yōu)速度和避免組合爆炸。
In proposbonal calculus , the processing ofresoluhon pdriciple have combination explosion naturally so , how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving 命題邏輯系統(tǒng)中的歸結(jié)原理本質(zhì)上存在組合問題,因此,如何避免組合問題(通常以計(jì)算復(fù)雜性的形式出現(xiàn))是自動推理研究中的一個(gè)重要課題。
Specialist system faces many problems and difficulties , such as knowledge acquirement depends on manual transplantation which leads to high cost and low efficiency ; applying general clarified set brings forward with feeble reasoning ability , matching collision and combination explosion . nowadays modern intelligent control focuses on fuzzy logic and neural networks or the combination of the two 由于專家系統(tǒng)在實(shí)際應(yīng)用中有較多的問題和困難(如:知識的獲取主要靠人工移植,因此成本高、效率低;采用常規(guī)的分明集,致使它的推理能力弱,容易產(chǎn)生匹配沖突、組合爆炸等問題) ,現(xiàn)在智能控制的重點(diǎn)則集中在模糊邏輯、神經(jīng)網(wǎng)絡(luò)以及二者的結(jié)合應(yīng)用上。
( 8 ) considering that probability causal model has not a qualitative standard to select parsimonious rules and there could be a problem of " combination explosion " when there are so many faults in the model , a method which combines probability causal model and genetic algorithm is put forward ( 8 )針對概率因果模型對于節(jié)約原則的選取沒有一個(gè)定量的標(biāo)準(zhǔn)和故障數(shù)目很奎慶大學(xué)博十學(xué)位論文多時(shí)問題解的“組合爆炸”問題,提出了一種將遺傳算法和概率因果模型相結(jié)合的故障診斷方法。
After the analysis of distribution network , a dynamic distribution network discrete model ( ddndm ) was presented based on the theory of the bi - level dynamic distribution network . furthermore , ant colony algorithm ( ac arithmetic ) , which is introduced in this dissertation because of the ability of resisting combination explosion to np - hard problem , now is applied in ddndm . then the ac arithmetic solve pattern , arithmetic steps and the instance result have been presented , and that the ac arithmetic applied in the ddndm to solve the np problem is appropriate 本文通過對分銷網(wǎng)絡(luò)分析,在已有的二級動態(tài)分銷網(wǎng)絡(luò)模型研究基礎(chǔ)上,提出了動態(tài)分銷網(wǎng)絡(luò)離散模型,并且在基于meta圖的供應(yīng)鏈集成網(wǎng)絡(luò)模型基礎(chǔ)上對模型進(jìn)行了優(yōu)化,最后采用對于np完全問題具有抵御組合爆炸特性的螞蟻算法求解此模型,給出了螞蟻算法求解的模式、解如何通過賦權(quán)meta圖構(gòu)造和具體算法步驟,還給出了實(shí)例結(jié)果,通過結(jié)果表明本文提出的基于螞蟻算法解決分銷網(wǎng)絡(luò)優(yōu)化中出現(xiàn)的np難題,能夠得到較好的效果。
Just like other optimization problems , coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space . if algorithm traverses the whole search space , search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time 與其它的最優(yōu)化問題一樣,聯(lián)盟形成需要在復(fù)雜而龐大的搜索空間尋找最優(yōu)解或滿意解,如果遍歷整個(gè)搜索空間,就會產(chǎn)生搜索組合爆炸,在多項(xiàng)式時(shí)間內(nèi)無法完成搜索。
Just like other optimization problem , coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space . if algorithm traverses the whole search space , search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time 與其他的最優(yōu)化問題一樣,聯(lián)盟形成需要在復(fù)雜而龐大的搜索空間中尋找最優(yōu)解或滿意解,如果遍歷整個(gè)搜索空間,就會產(chǎn)生搜索的組合爆炸,在多項(xiàng)式時(shí)間內(nèi)無法完成搜索。